bitmaps - meaning and definition. What is bitmaps
Diclib.com
Online Dictionary

What (who) is bitmaps - definition

METHOD OF INCREMENTALLY DISPLAYING RASTER GRAPHICS
Interlace (bitmaps); Bitmap interlacing; Interleaving (bitmaps)
  • An illustration of [[Adam7]] interlacing over a 16×16 image

Bitmap         
DATA STRUCTURE FOR MAPPING FROM SOME DOMAIN (FOR EXAMPLE, A RANGE OF INTEGERS) TO BITS
Bitmaps; Pixmap; Pixel display format; Bit-map; OS/2 bitmap; Bump file; Bitmap Image; Bitmap image; Bitmap image format; Recursive X-Y cut; Bitmap images; Recursive XY-cut
In computing, a bitmap is a mapping from some domain (for example, a range of integers) to bits. It is also called a bit array or bitmap index.
bitmap         
DATA STRUCTURE FOR MAPPING FROM SOME DOMAIN (FOR EXAMPLE, A RANGE OF INTEGERS) TO BITS
Bitmaps; Pixmap; Pixel display format; Bit-map; OS/2 bitmap; Bump file; Bitmap Image; Bitmap image; Bitmap image format; Recursive X-Y cut; Bitmap images; Recursive XY-cut
<graphics, file format> A data file or structure which corresponds bit for bit with an image displayed on a screen, probably in the same format as it would be stored in the display's video memory or maybe as a {device independent bitmap}. A bitmap is characterised by the width and height of the image in pixels and the number of bits per pixel which determines the number of shades of grey or colours it can represent. A bitmap representing a coloured image (a "pixmap") will usually have pixels with between one and eight bits for each of the red, green, and blue components, though other colour encodings are also used. The green component sometimes has more bits that the other two to cater for the human eye's greater discrimination in this component. See also vector graphics, image formats. (1996-09-21)
bitmap         
DATA STRUCTURE FOR MAPPING FROM SOME DOMAIN (FOR EXAMPLE, A RANGE OF INTEGERS) TO BITS
Bitmaps; Pixmap; Pixel display format; Bit-map; OS/2 bitmap; Bump file; Bitmap Image; Bitmap image; Bitmap image format; Recursive X-Y cut; Bitmap images; Recursive XY-cut
A bitmap is a type of graphics file on a computer. (COMPUTING)
...bitmap graphics for representing complex images such as photographs.
N-COUNT
Bitmap is also a verb.
Bitmapped maps require huge storage space.
VERB: V-ed

Wikipedia

Interlacing (bitmaps)

In computing, interlacing (also known as interleaving) is a method of encoding a bitmap image such that a person who has partially received it sees a degraded copy of the entire image. When communicating over a slow communications link, this is often preferable to seeing a perfectly clear copy of one part of the image, as it helps the viewer decide more quickly whether to abort or continue the transmission.

Interlacing is supported by the following formats, where it is optional:

  • GIF interlacing stores the lines in the order 0 , 8 , 16 , , ( 8 n ) ,   4 , 12 , , ( 8 n + 4 ) ,   2 , 6 , 10 , 14 , , ( 4 n + 2 ) ,   1 , 3 , 5 , 7 , 9 , , ( 2 n + 1 ) . {\displaystyle 0,8,16,\dots ,(8n),\ 4,12,\dots ,(8n+4),\ 2,6,10,14,\dots ,(4n+2),\ 1,3,5,7,9,\dots ,(2n+1).}
  • PNG uses the Adam7 algorithm, which interlaces in both the vertical and horizontal direction.
  • TGA uses two optional interlacing algorithms:
    • Two-way: 0 , 2 , 4 , , ( 2 n ) ,   1 , 3 , , ( 2 n + 1 ) , {\displaystyle 0,2,4,\dots ,(2n),\ 1,3,\dots ,(2n+1),}
    • And four-way: 0 , 4 , 8 , , ( 4 n ) ,   1 , 5 , , ( 4 n + 1 ) ,   2 , 6 , ,   ( 4 n + 2 ) , 3 , 7 , , ( 4 n + 3 ) . {\displaystyle 0,4,8,\dots ,(4n),\ 1,5,\dots ,(4n+1),\ 2,6,\dots ,\ (4n+2),3,7,\dots ,(4n+3).}
  • JPEG, JPEG 2000, and JPEG XR (actually using a frequency decomposition hierarchy rather than interlacing of pixel values)
  • PGF (also using a frequency decomposition)

Interlacing is a form of incremental decoding, because the image can be loaded incrementally. Another form of incremental decoding is progressive scan. In progressive scan the loaded image is decoded line for line, so instead of becoming incrementally clearer it becomes incrementally larger. The main difference between the interlace concept in bitmaps and in video is that even progressive bitmaps can be loaded over multiple frames.

For example: Interlaced GIF is a GIF image that seems to arrive on your display like an image coming through a slowly opening Venetian blind. A fuzzy outline of an image is gradually replaced by seven successive waves of bit streams that fill in the missing lines until the image arrives at its full resolution.

Interlaced graphics were once widely used in web design and before that in the distribution of graphics files over bulletin board systems and other low-speed communications methods. The practice is much less common today, as common broadband internet connections allow most images to be downloaded to the user's screen nearly instantaneously, and interlacing is usually an inefficient method of encoding images.

Interlacing has been criticized because it may not be clear to viewers when the image has finished rendering, unlike non-interlaced rendering, where progress is apparent (remaining data appears as blank). Also, the benefits of interlacing to those on low-speed connections may be outweighed by having to download a larger file, as interlaced images typically do not compress as well.